Non-commutativity and Expressive Deductive Logic Databases

Non-Determinism in Deductive Databases

This paper examines the problem of adding non-deterministic constructs to a declarative database language based on Horn Clause Logic. We revise a previously proposed approach, the choice construct introduced by Krishnamurthy and Naqvi, from the viewpoints of amenability to efficient implementation and expressive power. Thus, we define a construct called dynamic choice, which is consistent with ...

Minimal founded semantics for disjunctive logic programs and deductive databases

In this paper, we propose a variant of stable model semantics for disjunctive logic programming and deductive databases. The semantics, called minimal founded, generalizes stable model semantics for normal (i.e. non disjunctive) programs but differs from disjunctive stable model semantics (the extension of stable model semantics for disjunctive programs). Compared with disjunctive stable model ...

The Expressive Power of Partial Models in Disjunctive Deductive Databases

Expressive Power and Complexity of Partial Models for Disjunctive Deductive Databases 1

This paper investigates the expressive power and complexity of partial model semantics for disjunctive deductive databases. In particular, partial stable, regular model, maximal stable (M-stable), and least undeened stable (L-stable) semantics for function-free disjunctive logic programs are considered, for which the expressiveness of queries based on possibility and certainty inference is dete...

De ning and Translating Visual Schemas for Deductive Databases

We present a visual language expressive enough to capture an important subset of First Order Predicate Logic as well as its straightforward translation to the logic-based paradigm of deductive databases. We use the diagrams of our language to represent all the components of a deductive database schema: base predicates, derived predicates with their deductive rules, and integrity constraints. Ou...